Dynamic problem - PDFSEARCH.IO - Document Search Engine

Dynamic problem
Results: 444

#	Item
51	XX ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages MATTEO RIONDATO, Two Sigma Investments, LP ELI UPFAL, Brown University Add to Reading List Source URL: matteo.rionda.to Language: English - Date: 2016-07-30 12:22:15 Network theory Graph theory Graph connectivity Networks Edsger W. Dijkstra Centrality Betweenness centrality Shortest path problem Randomized algorithm Connected component Line graph
52	Local optimality in algebraic path problems (with help from Coq and Ssreflect) Timothy G. Griffin Computer Laboratory University of Cambridge, UK Add to Reading List Source URL: www.monmeetings.org Language: English - Date: 2015-09-04 10:24:56 Operations research Edsger W. Dijkstra Network theory Shortest path problem Mathematical optimization Routing algorithms Systems engineering Dynamic programming
53	IntelliDroid: A Targeted Input Generator for the Dynamic Analysis of Android Malware Michelle Y. Wong and David Lie Department of Electrical and Computer Engineering University of Toronto Add to Reading List Source URL: www.eecg.toronto.edu Language: English - Date: 2015-12-20 13:29:40 Smartphones Cross-platform software Object-oriented programming languages Malware Malware analysis Android Monkey X Application programming interface Concolic testing Event Java Constraint satisfaction problem
54	Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu Add to Reading List Source URL: www.utc.ices.cmu.edu Language: English - Date: 2014-10-10 12:11:58 Algebra of random variables Covariance and correlation Routing Covariance Shortest path problem Multivariate statistics Kalman filter
55	Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items Mihai Burcea⋆ , Prudence W.H. Wong, and Fencol C.C. Yung Department of Computer Science, University of Liverpool, UK {m.burcea,pwong}@liverpool.ac.uk, Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2013-01-24 10:01:00 Packing problems Bin packing problem
56	COMPUTING SHORTEST PATHS USING SPARSE GAUSSIAN ELIMINATION Aydın Bulu¸c, John Gilbert, Sivan Toledo SIAM Workshop on Network Science 2014 July 6-7 · Chicago For example, U ∗ encodes the paths from lower numbered Add to Reading List Source URL: siam.org Language: English - Date: 2014-06-30 13:57:26 Routing algorithms Network theory Graph theory Graph connectivity Dynamic programming FloydWarshall algorithm Shortest path problem Distance Path Planar separator theorem Edge disjoint shortest pair algorithm
57	A = a x aa m if and only if there is a mapping F: {1, 2, . . . , p} ~ {1, 2, . . . , m} such that f(i) = k only if c~ is ak and F is a m o n o t o n e strictly increasing function (i.e. F(i) = u, F ( j ) = v, a Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Dynamic programming Combinatorics Subsequence Longest common subsequence problem Longest increasing subsequence HuntMcIlroy algorithm
58	Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing ⋆ Prudence W.H. Wong and Fencol C.C. Yung Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2009-10-29 07:57:39 Packing problems Bin packing problem Bin Stack Knapsack problem
59	Solving Dynamic Constraint Satisfaction Problems: Relations between Problem Alteration and Search Performance Richard J. Wallace, Diarmuid Grimes and Eugene C. Freuder Cork Constraint Computation Centre and Department of Add to Reading List Source URL: tmancini.di.uniroma1.it Language: English - Date: 2008-12-16 11:07:53 Constraint programming Operations research Search algorithms Constraint satisfaction problem Mathematical optimization Constraint satisfaction Heuristic Algorithm Duality Backtracking Travelling salesman problem Local consistency
60	Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract Add to Reading List Source URL: pluto.huji.ac.il Language: English - Date: 2014-02-02 05:15:06 Operations research Dynamic programming Mathematical optimization Combinatorial optimization Bellman equation Control theory Knapsack problem Mechanism design

UPDATE